Investigating Octree Generation for Interactive Animated Volume Rendering

نویسنده

  • David Reilly
چکیده

v

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Octree-based Multiresolution Approach Supporting Interactive Rendering of Very Large Volume Data Sets

We present an octree-based approach supporting multiresolution volume rendering of large data sets. Given a set of scattered points without connectivity information, we impose an octree data structure of low resolution in the preprocessing step. The construction of this initial octree structure is controlled by the original data resolution and cell-speci c error values. Using the octree nodes, ...

متن کامل

Incremental Volume Rendering Using Hierarchical Compression

We present a new algorithm here for efficient incremental rendering of volumetric datasets. The primary goal of this algorithm is to give average workstations the ability to efficiently render volume data received over relatively low bandwidth network links in such a way that rapid user feedback is maintained. Common limitations of workstation rendering of volume data include: large memory over...

متن کامل

Simultaneous GPU-Assisted Raycasting of Unstructured Point Sets and Volumetric Grid Data

In the recent years the advent of powerful graphics hardware with programmable pixel shaders enabled interactive raycasting implementations on low-cost commodity desktop computers. Unlike slice-based volume rendering approaches GPU-assisted raycasting does not suffer from rendering artifacts caused by varying sample distances along different ray-directions or limited frame-buffer precision. It ...

متن کامل

Topology-Caching for Dynamic Particle Volume Raycasting

In this paper we present a volume rendering technique for the ad-hoc visualization of interactive particle systems. We focus on methods for an efficient spatial caching (topology caching) of particles when applying a raycasting approach. Thus, we get a fast reconstruction of the scalar field which is defined by the particles’ entities. The node-cache allows for efficient caching and pre-fetchin...

متن کامل

A Lipschitz Method for Accelerated

Interpolating discrete volume data into a continuous form adapts implicit surface techniques for rendering volumetric iso-surfaces. One such algorithm uses the Lipschitz condition to create an octree representation that accelerates volume rendering. Furthermore, only one preprocessing step is needed to create the Lipschitz-octree representation that accelerates rendering of iso-surfaces for any...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011